<!DOCTYPE html>
<html>

<head>
<meta charset="UTF-8">

<title> 提交记录 3877 - Judge Duck Online </title>

<link rel="icon" type="image/png" href="/images/judgeduck-logo-small.png" />

<script src="/libs/js/jquery-3.2.1.min.js"></script>

<!-- Latest compiled and minified CSS -->
<link rel="stylesheet" href="/libs/css/bootstrap.min.css" />

<!-- Latest compiled and minified JavaScript -->
<script src="/libs/js/bootstrap.min.js"></script>

<link rel="stylesheet" type="text/css" href="/css/main.css" />
<link rel="stylesheet" href="/css/non-responsive.css" type="text/css" />

<script src="/js/md5.js"></script>
<script src="/js/judgeduck.js"></script>

<script type="text/x-mathjax-config">
	MathJax.Hub.Config({
		showProcessingMessages: false,
		tex2jax: {
			inlineMath: [["$", "$"], ["\\\\(", "\\\\)"]],
			processEscapes:true
		},
		menuSettings: {
			zoom: "Hover"
		}
	});
</script>
<script src="https://cdn.jsdelivr.net/npm/mathjax@2.7.1/MathJax.js?config=TeX-AMS_HTML"></script>

<link rel="stylesheet" href="https://cdn.jsdelivr.net/simplemde/latest/simplemde.min.css">
<script src="https://cdn.jsdelivr.net/simplemde/latest/simplemde.min.js"></script>

</head>

<body onload="">

<!-- Fixed navbar -->
<nav class="navbar navbar-default" role="navigation" style="background-color: #eeeeee">
	<div class="container">
		<div class="navbar-header">
			<div class="navbar-brand">
				<a href="/">
					<img src="/images/judgeduck-logo.png" width="40px" height="40px" style="margin:-10px" />
				</a>
			</div>
			<font class="navbar-brand">
				Judge Duck Online
			</font>
		</div>
		<div class="navbar-collapse collapse">
			<ul class="nav navbar-nav">
				<li class="nav-item">
					<a class="nav-link" href="/index/index.html"> 首页 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/problems/index.html"> 题目列表 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/submissions/index.html"> 提交记录 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/blogs/index.html"> 博客 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/faq/index.html"> FAQ </a>
				</li>
			</ul>
			<ul class="nav navbar-nav navbar-right">
				<li class="nav-item">
					<a class="nav-link" href="/user/login/index.html"> 登录 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/user/register/index.html"> 注册 </a>
				</li>
			</ul>
		</div><!--/.nav-collapse -->
	</div>
</nav>




<div id="main_div" class="container" style="padding-left: 25px; padding-right: 25px">
	<h2> 提交记录 3877 </h2>
	<hr />
	
	<div class="row">
		<div class="col-xs-12">
			<table class="table table-bordered">
				<tr>
					<th class="col-xs-2"> 用户 </th>
					<th class="col-xs-3"> 题目 </th>
					<th class="col-xs-2"> 状态 </th>
					<th class="col-xs-1"> 得分 </th>
					<th class="col-xs-1"> 用时 </th>
					<th class="col-xs-1"> 内存 </th>
					<th class="col-xs-1"> 语言 </th>
					<th class="col-xs-1"> 代码长度 </th>
				</tr>
				<tr>
					<td style='font-size:13px'> <a href='/user/profile/skylee/index.html'> skylee </a> </td>
<td> <a href='/problem/noi18a/index.html'> noi18a. 【NOI2018】归程 </a> </td>
<td> Accepted </td>
<td> 100 </td>
<td style='font-size:13px'> 3.171 s </td>
<td style='font-size:13px'> 205 MB + 264 KB </td>
<td style='font-size:13px'> C++ </td>
<td style='font-size:13px'> 8.11 KB </td>
				</tr>
			</table>
			<table class="table table-bordered">
				<tr>
					<th class="col-xs-6"> 提交时间 </th>
					<th class="col-xs-6"> 评测时间 </th>
				</tr>
				<tr>
					<td style='font-size:13px'> 2018-07-18 19:26:11 </td>
<td style='font-size:13px'> 2019-01-19 00:56:56 </td>
				</tr>
			</table>
			<link rel="stylesheet" href="//cdn.jsdelivr.net/gh/highlightjs/cdn-release@9.12.0/build/styles/tomorrow.min.css">
			<script src="//cdn.jsdelivr.net/gh/highlightjs/cdn-release@9.12.0/build/highlight.min.js"></script>
			<script>hljs.initHighlightingOnLoad();</script>
			<div class="row">
				<label for="code"> 代码 </label>
				<pre style="background-color:white"><code class="cpp">#include&lt;cstdio&gt;
#include&lt;cctype&gt;
#include&lt;vector&gt;
#include&lt;climits&gt;
#include&lt;algorithm&gt;
#include&lt;functional&gt;
#include&lt;ext/pb_ds/priority_queue.hpp&gt;
inline int getint() {
	register char ch;
	while(!isdigit(ch=getchar()));
	register int x=ch^&#x27;0&#x27;;
	while(isdigit(ch=getchar())) x=(((x&lt;&lt;2)+x)&lt;&lt;1)+(ch^&#x27;0&#x27;);
	return x;
}
const int N=2e5+1,S=1e9,M=4e5+1,Q=4e5;
struct Edge {
	int to,l,a;
};
std::vector&lt;Edge&gt; e[N];
inline void add_edge(const int &amp;u,const int &amp;v,const int &amp;l,const int &amp;a) {
	e[u].push_back((Edge){v,l,a});
	e[v].push_back((Edge){u,l,a});
}
int n,m,q,k,s;
void reset() {
	for(register int i=1;i&lt;=n;i++) e[i].clear();
}
namespace subtask_same_elevation {
	int elevation,dis[N];
	struct Vertex {
		int w,id;
		bool operator &gt; (const Vertex &amp;rhs) const {
			return w&gt;rhs.w;
		}
	};
	void dijkstra() {
		static __gnu_pbds::priority_queue&lt;Vertex,std::greater&lt;Vertex&gt; &gt; q;
		static __gnu_pbds::priority_queue&lt;Vertex,std::greater&lt;Vertex&gt; &gt;::point_iterator p[N];
		for(register int i=1;i&lt;=n;i++) {
			p[i]=q.push((Vertex){dis[i]=i==1?0:INT_MAX,i});
		}
		while(!q.empty()) {
			const int x=q.top().id;
			q.pop();
			for(register unsigned i=0;i&lt;e[x].size();i++) {
				const int &amp;y=e[x][i].to,&amp;w=e[x][i].l;
				if(dis[x]+w&lt;dis[y]) {
					q.modify(p[y],(Vertex){dis[y]=dis[x]+w,y});
				}
			}
		}
	}
};
namespace subtask_tree {
	int dep[N],sum[N];
	class SegmentTree {
		#define mid ((b+e)&gt;&gt;1)
		private:
			static const int SIZE=N*40;
			struct Node {
				int val,left,right;
			};
			Node node[SIZE];
			int sz,new_node(const int &amp;p) {
				node[++sz]=node[p];
				return sz;
			}
		public:
			int root[N];
			void reset() {
				sz=0;
			}
			void insert(int &amp;p,const int &amp;b,const int &amp;e,const int &amp;x,const int &amp;y) {
				p=new_node(p);
				if(dep[y]&gt;=dep[node[p].val]) {
					node[p].val=y;
				}
				if(b==e) return;
				if(x&lt;=mid) insert(node[p].left,b,mid,x,y);
				if(x&gt;mid) insert(node[p].right,mid+1,e,x,y);
			}
			int query(const int &amp;p,const int &amp;b,const int &amp;e,const int &amp;x) {
				if(e==x) return node[p].val;
				if(x&lt;=mid) {
					return query(node[p].left,b,mid,x);
				} else {
					const int u=query(node[p].left,b,mid,mid);
					const int v=query(node[p].right,mid+1,e,x);
					return dep[u]&gt;dep[v]?u:v;
				}
			}
		#undef mid
	};
	SegmentTree t;
	void dfs(const int &amp;x,const int &amp;par) {
		for(unsigned i=0;i&lt;e[x].size();i++) {
			const int &amp;y=e[x][i].to,&amp;l=e[x][i].l,&amp;a=e[x][i].a;
			if(y==par) continue;
			sum[y]=sum[x]+l;
			dep[y]=dep[x]+1;
			t.insert(t.root[y]=t.root[x],0,S,a,y);
			dfs(y,x);
		}
	}
};
namespace subtask_offline {
	using namespace subtask_same_elevation;
	struct Edge2 {
		int u,v,w;
		bool operator &gt; (const Edge2 &amp;rhs) const {
			return w&gt;rhs.w;
		}
	};
	struct Query {
		int v,p,id;
		bool operator &gt; (const Query &amp;rhs) const {
			return p&gt;rhs.p;
		}
	};
	int ans[Q];
	Edge2 edge[M];
	Query que[Q];
	class DisjointSet {
		private:
			int anc[N],val[N];
			int find(const int &amp;x) {
				return x==anc[x]?x:anc[x]=find(anc[x]);
			}
		public:
			void init() {
				for(register int i=1;i&lt;=n;i++) {
					anc[i]=i;
					val[i]=dis[i];
				}
			}
			void merge(const int &amp;x,const int &amp;y) {
				const int p=find(x),q=find(y);
				val[q]=std::min(val[q],val[p]);
				anc[p]=q;
			}
			bool same(const int &amp;x,const int &amp;y) {
				return find(x)==find(y);
			}
			int query(const int &amp;x) {
				return val[find(x)];
			}
	};
	DisjointSet djs;
};
namespace subtask_n2 {
	using namespace subtask_same_elevation;
	using namespace subtask_offline;
};
namespace subtask_default {
	using namespace subtask_same_elevation;
	using namespace subtask_offline;
	struct PersistentDisjointSet {
		#define mid ((b+e)&gt;&gt;1)
		static const int SIZE=N*40;
		struct Node {
			int val,left,right,size,dist;
		};
		Node node[SIZE];
		int sz,new_node(const int &amp;p) {
			node[++sz]=node[p];
			return sz;
		}
		int getpos(const int &amp;p,const int &amp;b,const int &amp;e,const int &amp;x) {
			if(b==e) return p;
			return x&lt;=mid?getpos(node[p].left,b,mid,x):getpos(node[p].right,mid+1,e,x);
		}
		bool same(const int &amp;x,const int &amp;y) {
			return node[x].val==node[y].val;
		}
		int root[M];
		void reset() {
			root[0]=0;
			sz=0;
		}
		void build(int &amp;p,const int &amp;b,const int &amp;e) {
			p=new_node(p);
			if(b==e) {
				node[p].val=b;
				node[p].size=1;
				node[p].dist=dis[b];
				return;
			}
			build(node[p].left,b,mid);
			build(node[p].right,mid+1,e);
		}
		int find(const int &amp;p,const int &amp;b,const int &amp;e,const int &amp;x) {
			const int q=getpos(p,b,e,x);
			return x==node[q].val?q:find(p,b,e,node[q].val);
		}
		int merge2(int &amp;p,const int &amp;b,const int &amp;e,const int &amp;x,const int &amp;y,const int &amp;q) {
			p=new_node(p);
			if(b==e) {
				node[p].val=y;
				return p;
			}
			if(x&lt;=mid) return merge2(node[p].left,b,mid,x,y,q);
			if(x&gt;mid) return merge2(node[p].right,mid+1,e,x,y,q);
			return 0;
		}
		void merge3(int &amp;p,const int &amp;b,const int &amp;e,const int &amp;x,const int &amp;y,const int &amp;q) {
			p=new_node(p);
			if(b==e) {
				node[p].size+=node[q].size;
				node[p].dist=std::min(node[p].dist,node[q].dist);
				return;
			}
			if(x&lt;=mid) merge3(node[p].left,b,mid,x,y,q);
			if(x&gt;mid) merge3(node[p].right,mid+1,e,x,y,q);
		}
		void merge(int &amp;p,const int &amp;b,const int &amp;e,int x,int y) {
			x=find(p,b,e,x),y=find(p,b,e,y);
			if(same(x,y)) return;
			if(node[x].size&gt;node[y].size) std::swap(x,y);
			const int q=merge2(p,b,e,node[x].val,node[y].val,y);
			merge3(p,b,e,node[y].val,node[x].val,q);
		}
		#undef mid
	};
	PersistentDisjointSet pdjs;
	int hash[M];
};
int main() {
	//freopen(&quot;return.in&quot;,&quot;r&quot;,stdin);
	//freopen(&quot;return.out&quot;,&quot;w&quot;,stdout);
	for(register int T=getint();T;T--) {
		n=getint(),m=getint();
		bool is_tree=m==n-1;
		bool same_elevation=true;
		for(register int i=0;i&lt;m;i++) {
			const int u=getint(),v=getint(),l=getint(),a=getint();
			subtask_offline::edge[i]=(subtask_offline::Edge2){u,v,a};
			if(i!=0&amp;&amp;subtask_same_elevation::elevation!=a) same_elevation=false;
			add_edge(u,v,l,subtask_same_elevation::elevation=a);
		}
		q=getint(),k=getint(),s=getint();
		bool offline=k==0;
		if(q==0) {
			//point 1
			goto Next;
		}
		if(same_elevation&amp;&amp;offline) {
			//point 2~6
			using namespace subtask_same_elevation;
			dijkstra();
			for(register int i=0;i&lt;q;i++) {
				const int v=getint(),p=getint();
				printf(&quot;%d\n&quot;,p&lt;elevation?0:dis[v]);
			}
			goto Next;
		}
		if(is_tree) {
			//point 7~11
			using namespace subtask_tree;
			dfs(1,0);
			for(register int i=0,ans=0;i&lt;q;i++) {
				const int v=(getint()+k*ans-1)%n+1;
				const int p=(getint()+k*ans)%(s+1);
				printf(&quot;%d\n&quot;,ans=sum[t.query(t.root[v],0,S,p)]);
			}
			t.reset();
			goto Next;
		}
		if(offline) {
			//point 12~14
			using namespace subtask_offline;
			dijkstra();
			std::sort(&amp;edge[0],&amp;edge[m],std::greater&lt;Edge2&gt;());
			for(register int i=0;i&lt;q;i++) {
				const int v=getint(),p=getint();
				que[i]=(Query){v,p,i};
			}
			std::sort(&amp;que[0],&amp;que[q],std::greater&lt;Query&gt;());
			djs.init();
			for(register int i=0,j=0;j&lt;q;j++) {
				for(;edge[i].w&gt;que[j].p;i++) {
					const int &amp;u=edge[i].u,&amp;v=edge[i].v;
					if(djs.same(u,v)) continue;
					djs.merge(u,v);
				}
				ans[que[j].id]=djs.query(que[j].v);
			}
			for(register int i=0;i&lt;q;i++) {
				printf(&quot;%d\n&quot;,ans[i]);
			}
			goto Next;
		}
		if(n&lt;=1500&amp;&amp;m&lt;=4000&amp;&amp;q&lt;=2000) {
			//point 15~16
			using namespace subtask_n2;
			dijkstra();
			for(register int i=0,last=0;i&lt;q;i++) {
				const int v=(getint()+k*last-1)%n+1;
				const int p=(getint()+k*last)%(s+1);
				djs.init();
				for(register int i=0;i&lt;m;i++) {
					if(edge[i].w&lt;=p) continue;
					const int &amp;u=edge[i].u,&amp;v=edge[i].v;
					if(djs.same(u,v)) continue;
					djs.merge(u,v);
				}
				printf(&quot;%d\n&quot;,last=djs.query(v));
			}
			goto Next;
		}
		//point 17~20
		using namespace subtask_default;
		dijkstra();
		pdjs.build(pdjs.root[0],1,n);
		std::sort(&amp;edge[0],&amp;edge[m],std::greater&lt;Edge2&gt;());
		for(register int i=0;i&lt;m;i++) {
			hash[i+1]=edge[i].w;
			const int &amp;u=edge[i].u,&amp;v=edge[i].v;
			pdjs.merge(pdjs.root[i+1]=pdjs.root[i],1,n,u,v);
		}
		for(register int i=0,last=0;i&lt;q;i++) {
			const int v=(getint()+k*last-1)%n+1;
			const int p=(getint()+k*last)%(s+1);
			const int pos=std::lower_bound(&amp;hash[1],&amp;hash[m]+1,p,std::greater&lt;int&gt;())-&amp;hash[1];
			printf(&quot;%d\n&quot;,last=pdjs.node[pdjs.find(pdjs.root[pos],1,n,v)].dist);
		}
		pdjs.reset();
		Next:
			reset();
	}
	return 0;
}</code></pre>
				<br />
				
				<label for="result"> 评测结果 </label><div class="row"><div class="col-xs-12"><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Compilation</b></td><td class="col-xs-2" style="vertical-align:middle">N/A</td><td class="col-xs-2" style="vertical-align:middle">N/A</td><td class="col-xs-2" style="vertical-align:middle">Compile OK</td><td class="col-xs-2" style="vertical-align:middle">Score: N/A</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_1" aria-expanded="false" aria-controls="detail_1">显示更多</a></td></tr></table></div><div class="collapse" id="detail_1"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>Compiling...
Compile success!
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #1</b></td><td class="col-xs-2" style="vertical-align:middle">434.38 us</td><td class="col-xs-2" style="vertical-align:middle">2 MB + 328 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_18" aria-expanded="false" aria-controls="detail_18">显示更多</a>
<a id="4428cca48df0451f8eb06833614ee82f" href="http://www.iis7.com" target="_blank" style="display:inline-block;background-color:;color:#fff;padding:2px 5px;font-family:arial;font-size:12px;font-weight:bold;">iis7站长之家</a></td></tr></table></div><div class="collapse" id="detail_2"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 0.434378
mem_kb = 2376
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #2</b></td><td class="col-xs-2" style="vertical-align:middle">568.62 us</td><td class="col-xs-2" style="vertical-align:middle">3 MB + 104 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_3" aria-expanded="false" aria-controls="detail_3">显示更多</a></td></tr></table></div><div class="collapse" id="detail_3"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 0.568623
mem_kb = 3176
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #3</b></td><td class="col-xs-2" style="vertical-align:middle">657.29 us</td><td class="col-xs-2" style="vertical-align:middle">3 MB + 112 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_4" aria-expanded="false" aria-controls="detail_4">显示更多</a></td></tr></table></div><div class="collapse" id="detail_4"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 0.657288
mem_kb = 3184
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #4</b></td><td class="col-xs-2" style="vertical-align:middle">760.08 us</td><td class="col-xs-2" style="vertical-align:middle">3 MB + 128 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_5" aria-expanded="false" aria-controls="detail_5">显示更多</a></td></tr></table></div><div class="collapse" id="detail_5"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 0.760078
mem_kb = 3200
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #5</b></td><td class="col-xs-2" style="vertical-align:middle">3.328 ms</td><td class="col-xs-2" style="vertical-align:middle">3 MB + 512 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_6" aria-expanded="false" aria-controls="detail_6">显示更多</a></td></tr></table></div><div class="collapse" id="detail_6"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 3.328294
mem_kb = 3584
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #6</b></td><td class="col-xs-2" style="vertical-align:middle">530.41 ms</td><td class="col-xs-2" style="vertical-align:middle">48 MB + 360 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_7" aria-expanded="false" aria-controls="detail_7">显示更多</a></td></tr></table></div><div class="collapse" id="detail_7"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 530.409632
mem_kb = 49512
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #7</b></td><td class="col-xs-2" style="vertical-align:middle">4.791 ms</td><td class="col-xs-2" style="vertical-align:middle">3 MB + 188 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_8" aria-expanded="false" aria-controls="detail_8">显示更多</a></td></tr></table></div><div class="collapse" id="detail_8"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 4.790561
mem_kb = 3260
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #8</b></td><td class="col-xs-2" style="vertical-align:middle">4.782 ms</td><td class="col-xs-2" style="vertical-align:middle">3 MB + 192 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_9" aria-expanded="false" aria-controls="detail_9">显示更多</a></td></tr></table></div><div class="collapse" id="detail_9"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 4.781501
mem_kb = 3264
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #9</b></td><td class="col-xs-2" style="vertical-align:middle">4.774 ms</td><td class="col-xs-2" style="vertical-align:middle">3 MB + 188 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_10" aria-expanded="false" aria-controls="detail_10">显示更多</a></td></tr></table></div><div class="collapse" id="detail_10"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 4.774123
mem_kb = 3260
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #10</b></td><td class="col-xs-2" style="vertical-align:middle">679.536 ms</td><td class="col-xs-2" style="vertical-align:middle">111 MB + 536 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_11" aria-expanded="false" aria-controls="detail_11">显示更多</a></td></tr></table></div><div class="collapse" id="detail_11"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 679.535657
mem_kb = 114200
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #11</b></td><td class="col-xs-2" style="vertical-align:middle">679.89 ms</td><td class="col-xs-2" style="vertical-align:middle">111 MB + 540 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_12" aria-expanded="false" aria-controls="detail_12">显示更多</a></td></tr></table></div><div class="collapse" id="detail_12"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 679.889851
mem_kb = 114204
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #12</b></td><td class="col-xs-2" style="vertical-align:middle">711.523 ms</td><td class="col-xs-2" style="vertical-align:middle">50 MB + 1008 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_13" aria-expanded="false" aria-controls="detail_13">显示更多</a></td></tr></table></div><div class="collapse" id="detail_13"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 711.523448
mem_kb = 52208
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #13</b></td><td class="col-xs-2" style="vertical-align:middle">709.153 ms</td><td class="col-xs-2" style="vertical-align:middle">50 MB + 1004 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_14" aria-expanded="false" aria-controls="detail_14">显示更多</a></td></tr></table></div><div class="collapse" id="detail_14"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 709.152510
mem_kb = 52204
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #14</b></td><td class="col-xs-2" style="vertical-align:middle">712.741 ms</td><td class="col-xs-2" style="vertical-align:middle">50 MB + 1012 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_15" aria-expanded="false" aria-controls="detail_15">显示更多</a></td></tr></table></div><div class="collapse" id="detail_15"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 712.740821
mem_kb = 52212
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #15</b></td><td class="col-xs-2" style="vertical-align:middle">243.443 ms</td><td class="col-xs-2" style="vertical-align:middle">3 MB + 524 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_16" aria-expanded="false" aria-controls="detail_16">显示更多</a></td></tr></table></div><div class="collapse" id="detail_16"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 243.442877
mem_kb = 3596
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #16</b></td><td class="col-xs-2" style="vertical-align:middle">239.649 ms</td><td class="col-xs-2" style="vertical-align:middle">3 MB + 524 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_17" aria-expanded="false" aria-controls="detail_17">显示更多</a></td></tr></table></div><div class="collapse" id="detail_17"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 239.648840
mem_kb = 3596
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #17</b></td><td class="col-xs-2" style="vertical-align:middle">2.044 s</td><td class="col-xs-2" style="vertical-align:middle">201 MB + 820 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_18" aria-expanded="false" aria-controls="detail_18">显示更多</a></td></tr></table></div><div class="collapse" id="detail_18"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 2044.474945
mem_kb = 206644
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #18</b></td><td class="col-xs-2" style="vertical-align:middle">2.038 s</td><td class="col-xs-2" style="vertical-align:middle">201 MB + 856 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_19" aria-expanded="false" aria-controls="detail_19">显示更多</a></td></tr></table></div><div class="collapse" id="detail_19"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 2038.208977
mem_kb = 206680
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #19</b></td><td class="col-xs-2" style="vertical-align:middle">3.171 s</td><td class="col-xs-2" style="vertical-align:middle">205 MB + 264 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_20" aria-expanded="false" aria-controls="detail_20">显示更多</a></td></tr></table></div><div class="collapse" id="detail_20"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 3171.226971
mem_kb = 210184
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #20</b></td><td class="col-xs-2" style="vertical-align:middle">3.159 s</td><td class="col-xs-2" style="vertical-align:middle">203 MB + 544 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_21" aria-expanded="false" aria-controls="detail_21">显示更多</a></td></tr></table></div><div class="collapse" id="detail_21"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 3158.892474
mem_kb = 208416
Correct Answer
</textarea></div></div></div></div>
			</div>
		</div>
	</div>

	<hr />
	
	<div class="row">
		<p style="text-align: center; color: #888">
			Judge Duck Online | 评测鸭在线 <br />
			Server Time: 2019-08-02 17:19:03 | Loaded in 40 ms | <a href="/status/index.html"> Server Status </a> <br />
			个人娱乐项目，仅供学习交流使用
		</p>
	</div>
</div>

</body>

</html>
